Lower subdifferentiability of quadratic functions
نویسندگان
چکیده
منابع مشابه
On the Subdifferentiability of Convex Functions
(Thus the subgradients of / correspond to the nonvertical supporting hyperplanes to the convex set consisting of all the points of E®R lying above the graph of /.) The set of subgradients of / at x is denoted by dfix). If d/(x) is not empty, / is said to be subdifferentiable at x. If/actually had a gradient x* = V/(x) at x in the sense of Gateaux (or Frechet), one would in particular have d/(x)...
متن کاملBounded lower subdifferentiability optimization techniques: applications
In this article we develop a global optimization algorithm for quasiconvex programming where the objective function is a Lipschitz function which may have “flat parts”. We adapt the Extended Cutting Angle method to quasiconvex functions, which reduces significantly the number of iterations and objective function evaluations, and consequently the total computing time. Applications of such an alg...
متن کاملA lower estimate of harmonic functions
We shall give a lower estimate of harmonic functions of order greater than one in a half space, which generalize the result obtained by B. Ya. Levin in a half plane.
متن کاملOn the quadratic support of strongly convex functions
In this paper, we first introduce the notion of $c$-affine functions for $c> 0$. Then we deal with some properties of strongly convex functions in real inner product spaces by using a quadratic support function at each point which is $c$-affine. Moreover, a Hyers–-Ulam stability result for strongly convex functions is shown.
متن کاملGroups with Quadratic-Non-Quadratic Dehn Functions
We construct a finitely presented group G with non-quadratic Dehn function f majorizable by a quadratic function on arbitrary long intervals.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1993
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01580603